Dynamic Switching of Total-Order Broadcast Protocols

نویسندگان

  • Emili Miedes
  • Francesc D. Muñoz-Escoí
چکیده

The exchange of total order broadcast protocols for dependable applications has been already studied and solved in several previous papers. To this end, some switching mechanism is needed. All these solutions have been inspired in a two-phase algorithm. The first phase is needed to agree on the need of change, stopping then the old protocol. Whilst the second one is needed to wait for the delivery of all previously broadcast messages, allowing to start later with the new protocol. This introduces a blocking interval that could be quite long in networks with high latency (e.g., WANs) or in systems with slow (i.e., heavily loaded) processes. We propose a new switching mechanism that avoids all such inconveniences, ensuring a fast migration between different broadcast protocols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

Performance Evaluation of Unicast and Broadcast Mobile Ad hoc Network Routing Protocols

Efficient routing mechanism is a challenging issue for group oriented computing in Mobile Ad Hoc Networks (MANETs). The ability of MANETs to support adequate Quality of Service (QoS) for group communication is limited by the ability of the underlying ad-hoc routing protocols to provide consistent behavior despite the dynamic properties of mobile computing devices. In MANET QoS requirements can ...

متن کامل

Broadcast Protocols for Distributed Systems

We present an innovative approach to the design of faultprocessors agree on exactly the same sequence of broadcast tolerant distributed systems that avoids the several rounds of message exchange required by current protocols for consensus agreement. The messages. approach is based on broadcast communication over a local area It is easy to demonstrate that placing a total order on network, such ...

متن کامل

FastCast: A Throughput- and Latency-Efficient Total Order Broadcast Protocol

Many uniform total order broadcast protocols have been designed in the last 30 years. Unfortunately, none of them achieves both optimal throughput and low latency. Indeed, protocols achieving optimal throughput rely on a ring dissemination pattern, which induces high latencies. Protocols achieving low latency rely on IP multicast and fail to achieve good throughput because of message losses. In...

متن کامل

Fast Message Ordering and Membership Using a Logical Token-Passing Ring

Many protocols exist to support the maintenance of consistency of data in fault-tolerant distributed systems ; these protocols are quite expensive and thus have not been widely adopted. The Totem protocol supports consistent concurrent operations by placing a total order on broadcast messages. This total order is achieved by including a sequence number in a token circulated around a logical rin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010